Nested sliding window protocols with packet fragmentation
نویسندگان
چکیده
منابع مشابه
Nested Sliding Window Protocols with Packet Fragmentation Gerald W . Shapiro
A single-hop OSI structured network with multiple layers of sliding window flow control and packet fragmentation between layers is analyzed. An approximation algorithm is presented to hierarchically reduce the network to a single queue whose performance characteristics represent the original network. Network transmission characteristics are restricted to Erlang distributions. Validation against...
متن کاملPacket Scheduling with Fragmentation
We investigate a scheduling problem in a TDMA environment where packets may be fragmented. Our model of the problem is derived from a scheduling problem present in data over CATV networks, where a slotted TDMA channel is used to carry both real-time and best-effort traffic. Packets of real-time flows have high priority and are allocated in fixed, periodically located slots. Best-effort packets ...
متن کاملSliding Window Logic Simulation
Existing digital logic simulators typically depend on a discrete-time model of circuit behaviour. Whilst this approach is sufficient in many cases for the validation of the behaviour of synchronous circuits, it is not good at identifying glitches that are narrower than the available time resolution. Moreover, it is not generally feasible to accommodate uncertainty in delay time in such a way as...
متن کاملSkip-Sliding Window Codes
Constrained coding is used widely in digital communication and storage systems. In this paper, we study a generalized sliding window constraint called the skip-sliding window. A skip-sliding window (SSW) code is defined in terms of the length L of a sliding window, skip length J , and cost constraint E in each sliding window. Each valid codeword of length L+kJ is determined by k+1 windows of le...
متن کاملSorted Sliding Window Compression
Sorted Sliding Window Compression (SSWC) uses a new model (Sorted Sliding Window Model | SSWM) to encode strings e cient, which appear again while encoding a symbol sequence. The SSWM holds statistics of all strings up to certain length k in a sliding window of size n (the sliding window is de ned like in lz77). The compression program can use the SSWM to determine if the string of the next sym...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 1993
ISSN: 0090-6778
DOI: 10.1109/26.212369